منابع مشابه
Controlling rewriting by rewriting
In this paper, we investigate the idea of controlling rewriting by strategies and we develop a strategy language whose operational semantics is also based on rewriting. This language is described in ELAN, a language based on computational systems that are simply rewriting theories controlled by strategies. We illustrate the syntax, semantics and diierent features of this strategy language. Fina...
متن کاملBi-rewriting rewriting logic
Rewriting logic appears to have good properties as logical framework, and can be useful for the development of programming languages which attempt to integrate various paradigms of declarative programming. In this paper I propose to tend towards the operational semantics for such languages by basing it on bi-rewrite systems and ordered chaining calculi which apply rewrite techniques to rst-orde...
متن کاملData refinement by rewriting
One of the activities in the step-wise development of programs is the transformation of abstract programs involving abstract data types, such as graphs, sets, and sequences, that are not normally available as primitive in programming languages, into executable concrete programs in which a representation of these types is provided. Apart from the change of data representation, such a data refine...
متن کاملPlanning by Rewriting
Domain-independent planning is a hard combinatorial problem. Taking into account plan quality makes the task even more difficult. This article introduces Planning by Rewriting (PbR), a new paradigm for efficient high-quality domain-independent planning. PbR exploits declarative plan-rewriting rules and efficient local search techniques to transform an easy-to-generate, but possibly suboptimal, ...
متن کاملComplexity Analysis by Rewriting
In this paper we introduce a restrictive version of the multiset path order, called polynomial path order. This recursive path order induces polynomial bounds on the maximal number of innermost rewrite steps. This result opens the way to automatically verify for a given program, written in an eager functional programming language, that the maximal number of evaluation steps starting from any fu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1996
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)00039-8